Memoizing purely functional top-down backtracking language processors
نویسندگان
چکیده
منابع مشابه
Memoizing Purely Functional Top-Down Backtracking Language Processors
Language processors may be implemented directly as functions. In a programming language that supports higher-order functions, large processors can be built by combining smaller components using higher-order functions corresponding to alternation and sequencing in the BNF notation of the grammar of the language to be processed. If the higher-order functions are defined to implement a top-down ba...
متن کاملWhat is a Purely Functional Language?
Functional programming languages are informally classified into pure and impure languages. The precise meaning of this distinction has been a matter of controversy. We therefore investigate a formal definition of purity. We begin by showing that some proposed definitions which rely on confluence, soundness of the beta axiom, preservation of pure observational equivalences and independence of th...
متن کاملTop-down modeling of RISC processors in VHDL
In this report, we present a top-down VHDL modeling technique which consists of two main modeling levels: speci cation level and functional level. We modeled a RISC Processor (RP) in order to demonstrate the feasibility and e ectiveness of this methodology. All models have been simulated on a SPARC 1 workstation using the ZYCAD VHDL simulator, version 1.0a. Experimental results show feasibility...
متن کاملProbabilistic top-down parsing and language modeling
This paper describes the functioning of a broad-coverage probabilistic top-down parser, and its application to the problem of language modeling for speech recognition. The paper first introduces key notions in language modeling and probabilistic parsing, and briefly reviews some previous approaches to using syntactic structure for language modeling. A lexicalized probabilistic topdown parser is...
متن کاملA Memoizing Semantics for Functional Logic Languages
Declarative multi-paradigm languages combine the main features of functional and logic programming, like laziness, logic variables and non-determinism. The operational semantics of these languages is based on a combination of narrowing and residuation. In this article, we introduce a non-standard memoizing semantics for multi-paradigm declarative programs and prove its equivalence with the stan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1996
ISSN: 0167-6423
DOI: 10.1016/0167-6423(96)00014-7